Enumerating meandric systems with large number of loops
نویسندگان
چکیده
منابع مشابه
Finding and enumerating large intersections
We study the calculation of the largest pairwise intersections in a given set family. We give combinatorial and algorithmic results both for the worst case and for set families where the frequencies of elements follow a power law, as words in texts typically do. The results can be used in faster preprocessing routines in a simple approach to multi-document summarization.
متن کاملA Rare Case of Maxillary Compound Odontoma with an Unusual Large Number of Denticles
Odontoma is the most frequent odontogenic gnathic tumor, which is considered to be a hamartomatous lesion rather than an actual odontogenic tumor. Odontoma is basically composed of enamel and dentin, while it could also have various contents of cementum and pulp tissue. These lesions may manifest in two specific forms, including the compound type with multiple, small, tooth-like structures and ...
متن کاملSolving some gauge systems with large number of colours
Spectra of space reduced gauge theories are studied using Fock space methods. After short review of the SU(2) model we discuss in detail the non-abelian supersymmetric system with one fermion and one boson in the large N limit. The system turns out to be very rich exhibiting a phase transition and a strong-weak duality. Moreover it is equivalent, at strong 't Hooft coupling, to the XXZ chain of...
متن کاملEnumerating Large Orbits and Direct Condensation
We describe a new implementation of direct condensation, which is a tool in computational representation theory. The crucial point for this is the enumeration of very large orbits for a group acting on some set. We present a variation of the standard orbit enumeration algorithm that reduces the amount of storage needed and behaves well under parallelization. For the special case of matrices act...
متن کاملEnumerating Circuits and Loops in Graphs with Self-Arcs and Multiple-Arcs
The problems of detecting and enumerating circuits in graphs and networks are still of fundamental importance. We extend the circuit enumeration algorithm of Johnson for graphs with directed-arcs, multiple-arcs and self-arcs and present a memory efficient and high-performance implementation in the D programming language. We also discuss other circuit applications including how the code could be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’Institut Henri Poincaré D
سال: 2019
ISSN: 2308-5827
DOI: 10.4171/aihpd/80